Balancing Distributed Key-Value Stores with Efficient In-Network Redirecting
نویسندگان
چکیده
منابع مشابه
Load balancing for Key Value Data Stores
In the last decade new scalable data stores have emerged in order to process and store the increasing amount of data that is produced every day. These data stores are inherently distributed to adapt to the increasing load and generated data. HBase is one of such data stores built after Google BigTable that stores large tables (hundreds of millions of rows) where data is stored sorted by key. A ...
متن کاملAchieving Data-Aware Load Balancing through Distributed Queues and Key/Value Stores
Load balancing techniques (e.g. work stealing) are important to obtain the best performance for distributed task scheduling system. In work stealing, tasks are randomly migrated from heavy-loaded schedulers to idle ones. However, for data-intensive applications where tasks are dependent and task execution involves processing large amount of data, migrating tasks blindly would compromise the dat...
متن کاملDistributed Moving Objects Database Based on Key-Value Stores
Moving objects databases (MOD) have been studied intensively and extensively in the database field. Recently, the emerging Big Data trend, which refers to a collection of large, complex, and rapidly growing geographical data collected from sensors and GPS-enabled devices, has posed new requirements for MOD: the ability to manage massive volume of data, the support for low-latency spatio-tempora...
متن کاملHardware Acceleration of Key-Value Stores
In-memory key-value stores are an important part of many datacenter applications. Web applications frequently use such software to cache the results of frequently recurring computations. Reducing the latency of key-value lookups will therefore go a long way towards improving total request latency. As a significant portion of the processing time for a request is due to the OS and application ove...
متن کاملFast Scans on Key-Value Stores
Key-Value Stores (KVS) are becoming increasingly popular because they scale up and down elastically, sustain high throughputs for get/put workloads and have low latencies. KVS owe these advantages to their simplicity. This simplicity, however, comes at a cost: It is expensive to process complex, analytical queries on top of a KVS because today’s generation of KVS does not support an efficient w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2019
ISSN: 2079-9292
DOI: 10.3390/electronics8091008